Path Visualization for Adjacency Matrices
نویسندگان
چکیده
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far better for the task of path finding because a path can be easily traced by following the corresponding links, provided that the links are not heavily crossed or tangled. We augment adjacency matrices with path visualization and associated interaction techniques to facilitate path finding. Our design is visually pleasing, and also effectively displays multiple paths based on the design commonly found in metro maps. We illustrate and assess the key aspects of our design with the results obtained from two case studies and an informal user study.
منابع مشابه
MatLink: Enhanced Matrix Visualization for Analyzing Social Networks
Visualizing social networks presents challeges for both nodelink and adjacency matrix representations. Social networks are locally dense, which makes node-link displays unreadable. Yet, main analysis tasks require following paths, which is difficult on matrices. This article presents MatLink, a hybrid representation with links overlaid on the borders of a matrix and dynamic topological feedback...
متن کاملLattice path enumeration and Toeplitz matrices
This paper is about counting lattice paths. Examples are the paths counted by Catalan, Motzkin or Schröder numbers. We identify lattice paths with walks on some path-like graph. The entries of the nth power of the adjacency matrix are the number of paths of length nwith prescribed start and end position. The adjacency matrices turn out to be Toeplitz matrices. Explicit expressions for eigenvalu...
متن کاملA Routing Method Based on Cost Matrix in Ad Hoc Networks
An ad hoc network does not rely on an existing infrastructure and it is organized as a network with nodes that act as hosts and routers to transmit packets. With its frequent change in topology, an ad hoc network does not rely on routing methods for pre-established wired networks; it requires a special routing method. In this paper, we introduce an agent based routing algorithm. The agent node ...
متن کاملVisualization of Small World Networks Using Similarity Matrices
Visualization of small world networks is challenging owing to the large size of the data and its property of being “locally dense but globally sparse.” Generally networks are represented using graph layouts and images of adjacency matrices, which have shortcomings of occlusion and spatial complexity in its direct form. These shortcomings are usually alleviated using pixel displays, hierarchical...
متن کاملTreeMatrix: A Hybrid Visualization of Compound Graphs
We present a hybrid visualization technique for compound graphs (i.e., networks with a hierarchical clustering defined on the nodes) that combines the use of adjacency matrices, node-link and arc diagrams to show the graph, and also combines the use of nested inclusion and icicle diagrams to show the hierarchical clustering. The graph visualized with our technique may have edges that are weight...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007